A PTAS for the cardinality constrained covering with unit balls
نویسندگان
چکیده
منابع مشابه
A Robust PTAS for the Parallel Machine Covering Problem
Problem definition. We consider the classical scheduling problem of maximizing the minimum machine load on parallel machines. In this setting we are given a set of jobs J , a set of machines M to process the jobs and a processing time pj for each job j ∈ J . For a given assignment of jobs to machines, the load of a machine i is defined as the sum of the processing of jobs assigned to i. Our obj...
متن کاملA Robust PTAS for Machine Covering and Packing
Scheduling a set of n jobs on m identical parallel machines so as to minimize the makespan or maximize the minimum machine load are two of the most important and fundamental scheduling problems studied in the literature. We consider the general online scenario where jobs are consecutively added to and/or deleted from an instance. The goal is to always maintain a (close to) optimal assignment of...
متن کاملCovering an ellipsoid with equal balls
The thinnest coverings of ellipsoids are studied in the Euclidean spaces of an arbitrary dimension n. Given any ellipsoid, our goal is to find the minimum number of unit balls needed to cover this ellipsoid. A tight asymptotic bound on the logarithm of this number is obtained. © 2006 Elsevier Inc. All rights reserved.
متن کاملOn covering bridged plane triangulations with balls
We show that every plane graph of diameter 2r in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius r : 2003 Wiley Periodicals, Inc. J Graph Theory 44:
متن کاملA PTAS for the Weighted Unit Disk Cover Problem
We are given a set of weighted unit disks and a set of points in Euclidean plane. The minimum weight unit disk cover (WUDC) problem asks for a subset of disks of minimum total weight that covers all given points. WUDC is one of the geometric set cover problems, which have been studied extensively for the past two decades (for many different geometric range spaces, such as (unit) disks, halfspac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.01.026